Complete proof rules for strong fairness and strong extreme fairness

Coping With Strong Fairness

We consider the veriication of linear temporal logic (LTL) properties of Petri nets, where the transitions can have both weak and strong fairness constraints. Allowing the transitions to have weak or strong fairness constraints simpliies the modeling of systems in many cases. We use the automata theoretic approach to model checking. To cope with the strong fairness constraints eeciently we empl...

PressCoping With Strong Fairness

On strong fairness in UNITY

In [6] Tsay and Bagrodia present a correct and complete proof rule for proving within UNITY statements of the form “(true 7→ p) ⇒ (true 7→ q). Their result is obtained by specializing a proof rule due to Manna and Pnueli [5] and translating premises and conclusions into the UNITY framework. However, specializing the rule from [5] is not sufficient, details of the proof have to be invoked and mo...

Model Checking with Strong Fairness

In this paper we present a coherent framework for symbolic model checking of linear time tem poral logic ltl properties over nite state reactive systems taking full fairness constraints into consideration We use the computational model of a fair discrete system fds which takes into account both justice weak fairness and compassion strong fairness The approach presented here reduces the model ch...

Strong Interaction Fairness via Randomization

We present Multi, a symmetric, fully distributed, randomized algorithm that, with probability 1, schedules multiparty interactions in a strongly fair manner. To our knowledge, Multi is the rst algorithm for strong interaction fairness to appear in the literature. Moreover , the expected time taken by Multi to establish an interaction is a constant not depending on the total number of processes ...